Effective Fractal Dimension in Algorithmic Information Theory
نویسنده
چکیده
Hausdorff dimension assigns a dimension value to each subset of an arbitrary metric space. In Euclidean space, this concept coincides with our intuition that smooth curves have dimension 1 and smooth surfaces have dimension 2, but from its introduction in 1918 [23] Hausdorff noted that many sets have noninteger dimension, what he called “fractional dimension”. The development and applications of Fractal Geometry quickly outgrew the field of Geometry and spread through many other areas [19, 56, 15, 16, 17, 13, 12, 49]. In the 1980s Tricot [73] and Sullivan [71] independently developed a dual of Hausdorff dimension called packing dimension that is now widely used. In this paper we will focus on the use of fractal dimensions in the Cantor space of infinite sequences over a finite alphabet. The results obtained since the 1990’s, and in particular the effectivizations of dimension that we will review in this paper, have introduced the powerful tools of fractal geometry into Computational Complexity and Information Theory. In 2000 Lutz [45] proved a new characterization of Hausdorff dimension for the case of Cantor space that was based on gales. This characterization was the beginning of a whole range of effective versions of dimensions naturally based on bounding the computing power of the gale. Gales are a generalization of martingales which are strategies for betting on the successive bits of infinite binary sequences with fair payoffs. Martingales were introduced by Ville [74] in 1939 (also implicit in [38, 39]) and used by Schnorr [61, 62, 63, 64] in his work on randomness. In the 1990s, Ryabko [59, 60] and Staiger [69] proved several connections of Hausdorff dimension and martingales, that included relating the Hausdorff dimension of a set X of binary sequences to the growth rates achievable by computable martingales betting on the sequences in X (see section 4 for more details). The introduction of resource-bounded dimension by Lutz [45] had the immediate motivation of overcoming the limitations of resource-bounded measure, a
منابع مشابه
Thema Computability and Fractal Dimension
This thesis combines computability theory and various notions of fractal dimension, mainly Hausdorff dimension. An algorithmic approach to Hausdorff measures makes it possible to define the Hausdorff dimension of individual points instead of sets in a metric space. This idea was first realized by Lutz (2000b). Working in the Cantor space 2ω of all infinite binary sequences, we study the theory ...
متن کاملZeta-Dimension
The zeta-dimension of a set A of positive integers is Dimζ(A) = inf{s | ζA(s) < ∞}, where ζA(s) = ∑ n∈A n. Zeta-dimension serves as a fractal dimension on Z that extends naturally and usefully to discrete lattices such as Z, where d is a positive integer. This paper reviews the origins of zeta-dimension (which date to the eighteenth and nineteenth centuries) and develops its basic theory, with ...
متن کاملComputability and fractal dimension
This thesis combines computability theory and various notions of fractal dimension, mainly Hausdorff dimension. An algorithmic approach to Hausdorff measures makes it possible to define the Hausdorff dimension of individual points instead of sets in a metric space. This idea was first realized by Lutz (2000b). Working in the Cantor space 2ω of all infinite binary sequences, we study the theory ...
متن کاملAnalysis of Resting-State fMRI Topological Graph Theory Properties in Methamphetamine Drug Users Applying Box-Counting Fractal Dimension
Introduction: Graph theoretical analysis of functional Magnetic Resonance Imaging (fMRI) data has provided new measures of mapping human brain in vivo. Of all methods to measure the functional connectivity between regions, Linear Correlation (LC) calculation of activity time series of the brain regions as a linear measure is considered the most ubiquitous one. The strength of the dependence obl...
متن کاملFractal Intersections and Products via Algorithmic Dimension
Algorithmic dimensions quantify the algorithmic information density of individual points and may be defined in terms of Kolmogorov complexity. This work uses these dimensions to bound the classical Hausdorff and packing dimensions of intersections and Cartesian products of fractals in Euclidean spaces. This approach shows that a known intersection formula for Borel sets holds for arbitrary sets...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006